The Farsighted Stable Set by Debraj Ray

نویسنده

  • RAJIV VOHRA
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximality in the Farsighted Stable Set

The stable set of von Neumann and Morgenstern imposes credibility on coalitional deviations. Their credibility notion can be extended to cover farsighted coalitional deviations, as proposed by Harsanyi (1974), and more recently reformulated by Ray and Vohra (2015). However, the resulting farsighted stable set suffers from a conceptual drawback: while coalitional deviations improve on existing o...

متن کامل

Supplement to “ the Farsighted Stable Set ”

There can, of course, be no concessions as regards existence. If it should turn out that our requirements concerning a solution. . . are, in any special case, unfulfillable,—this would certainly necessitate a fundamental change in the theory. Thus a general proof of the existence of solutions. . . for all particular cases1 is most desirable. It will appear from our subsequent investigations tha...

متن کامل

Rational expectations and farsighted stability

In the study of farsighted coalitional behavior, a central role is played by the von Neumann-Morgenstern (1944) stable set and its modification that incorporates farsightedness. Such a modification was first proposed by Harsanyi (1974) and has recently been re-formulated by Ray and Vohra (2015). The farsighted stable set is based on a notion of indirect dominance in which an outcome can be domi...

متن کامل

Farsighted network formation

This paper studies a model of dynamic network formation when individuals are farsighted : players evaluate the desirability of a “current" move in terms of its consequences on the entire discounted stream of payoffs. We define a concept of equilibrium which takes into account farsighted behavior of agents and allows for limited cooperation amongst agents. We show that an equilibrium process of ...

متن کامل

A Farsighted Stable Set for Partition Function Games

In this paper, we introduce a concept of a farsighted stable set for a partition function game and interpret the union of all farsighted stable sets as the core of the game, to be called the strongcore, which reduces to the traditional core if the worth of every coalition is independent of the partition to which it belongs and the game is adequately represented by a characteristic function. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015